Thek-server dual and loose competitiveness for paging

The Competitiveness of on - Line Demand Paging

We investigate the performance ofon-line demand paging algorithms (in comparison with the optimal off-line demand paging algorithms) for generalized two level memo­ ries, which are two level memories whose second level is composed of different speed memories. We consider and model variants of this problem which are of practical inter­ est. We especially investigate LRU and FIFO, which are both ...

Paging Problem With Primal - Dual Framework

We first consider a covering formulation for the problem. The LP is not strictly covering and it has box constraints (of the type xi ≤ 1), but as we shall see this will not cause any problems with the primal dual framework. For more on the PD method with box constraints we refer to [4] We first give some notation. Let pt denote the page requested at time t. Wlog we assume that the cache has pag...

Paging for Multicore Processors

Paging for multicore processors extends the classical paging problem to a setting in which several processes simultaneously share the cache. Recently, Hassidim [16] studied cache eviction policies for multicores under the traditional competitive analysis metric, showing that LRU is not competitive against an offline policy that has the power of arbitrarily delaying request sequences to its adva...

THE HOMOLOGY REPRESENTATIONS OF THEk - EQUAL PARTITION

Paging for Multicore (CMP) Caches

In the last few years, multicore processors have become the dominant processor architec-ture. While cache eviction policies have been widely studied both in theory and practice forsequential processors, in the case in which various simultaneous processes use a shared cachethe performance of even the most common eviction policies is not yet fully understood, nor dowe know if curr...